Optimal Drivers for the 'Random' Iteration Algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Random Iteration Algorithm for Graph-Directed Sets

A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtained by this algorithm reflect a probability measure which is invariant with respect to the system of contractions with probabilities.

متن کامل

An Optimal Value Iteration Algorithm for Parity Games

The quest for a polynomial time algorithm for solving parity games gained momentum in 2017 when two different quasipolynomial time algorithms were constructed. In this paper, we further analyse the second algorithm due to Jurdziński and Lazić and called the succinct progress measure algorithm. It was presented as an improvement over a previous algorithm called the small progress measure algorit...

متن کامل

The Fixpoint-Iteration Algorithm for Parity Games

It is known that the model checking problem for the modal μ-calculus reduces to the problem of solving a parity game and vice-versa. The latter is realised by the Walukiewicz formulas which are satisfied by a node in a parity game iff player 0 wins the game from this node. Thus, they define her winning region, and any model checking algorithm for the modal μ-calculus, suitably specialised to th...

متن کامل

Convergence and Stability of Modified Random SP-Iteration for A Generalized Asymptotically Quasi-Nonexpansive Mappings

The purpose of this paper is to study the convergence and the almost sure T-stability of the modied SP-type random iterative algorithm in a separable Banach spaces. The Bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure T-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. Our result...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1994

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/37.7.629